منابع مشابه
Generating Random Orthogonal Polygons
We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a technique we developed to obtain polygons with an increasing number of vertices starting from a unit square. The other follows a constraint programming approach and gives great control on the generated polygons. In particular, it...
متن کاملCurvature of random walks and random polygons in confinement
The purpose of this paper is to study the curvature of equilateral random walks and polygons that are confined in a sphere. Curvature is one of several basic geometric properties that can be used to describe random walks and polygons. We show that confinement affects curvature quite strongly, and in the limit case where the confinement diameter equals the edge length the unconfined expected cur...
متن کاملGenerating random star-shaped polygons
In this paper we deal with two problems on star-shaped polygons. At rst, we present a Las-Vegas algorithm that uniformly at random creates a star-shaped polygon whose vertices are given by a point set S of n points in the plane that does not admit degenerated star-shaped polygons. The expected running time of the algorithm is O(n logn) and it uses O(n) memory. We call a starshaped polygon degen...
متن کاملHeuristics for the Generation of Random Polygons
We consider the problem of randomly generating simple polygons on a given set of points. This problem is of considerable importance in the practical evaluation of algorithms that operate on polygons, where it is necessary to check the correctness and to determine the actual CPU-consumption of an algorithm experimentally. We rst present an approach by O'Rourke and Virmani (1991). Next, we discus...
متن کاملAllocating Vertex π - Guards in Simple Polygons via Pseudo - Triangulations ∗
We use the concept of pointed pseudo-triangulations to establish new upper and lower bounds on a well known problem from the area of art galleries: What is the worst case optimal number of vertex π -guards that collectively monitor a simple polygon with n vertices? Our results are as follows: 1. Any simple polygon with n vertices can be monitored by at most n/2 general vertex π -guards. This bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Mathematics
سال: 2019
ISSN: 2391-5455
DOI: 10.1515/math-2019-0049